Mechanism for interrupting and resuming execution on an unprotected pipeline processor

ABSTRACT

Techniques related to executing a plurality of instructions by a processor comprising receiving a first instruction for execution on an instruction execution pipeline, beginning execution of the first instruction, receiving one or more second instructions for execution on the instruction execution pipeline, the one or more second instructions associated with a higher priority task than the first instruction, storing a register state associated with the execution of the first instruction in one or more registers of a capture queue associated with the instruction execution pipeline, copying the register state from the capture queue to a memory, determining that the one or more second instructions have been executed, copying the register state from the memory to the one or more registers of the capture queue, and restoring the register state to the instruction execution pipeline from the capture queue.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.16/384,434, filed Apr. 15, 2019, which claims priority to U.S.Provisional Application No. 62/786,471, filed Dec. 30, 2018, and is acontinuation-in-part of U.S. patent application Ser. No. 16/227,238,filed Dec. 20, 2018, which is a continuation of U.S. patent applicationSer. No. 15/429,205, filed Feb. 10, 2017, now issued as U.S. Pat. No.10,162,641, which is a division of U.S. patent application Ser. No.14/331,986, filed Jul. 15, 2014, now issued as U.S. Pat. No. 9,606,803,which claims priority to U.S. Provisional Application No. 61/846,148,filed Jul. 15, 2013, all of which are hereby incorporated by reference.

BACKGROUND

Digital signal processors (DSP) are optimized for processing streams ofdata that may be derived from various input signals, such as sensordata, a video stream, a voice channel, radar signals, biomedicalsignals, etc. Digital signal processors operating on real-time datatypically receive an input data stream, perform a filter function on thedata stream (such as encoding or decoding) and output a transformed datastream. The system is called real-time because the application fails ifthe transformed data stream is not available for output when scheduled.Typical video encoding utilizes a predictable but non-sequential inputdata pattern. A typical application requires memory access to load dataregisters in a data register file and then supply data from the dataregisters to functional units which perform the data processing.

One or more DSP processing cores may be combined with various peripheralcircuits, blocks of memory, etc. on a single integrated circuit (IC) dieto form a system on chip (SoC). The advent of SoC architectures forembedded systems has created many challenges for the softwaredevelopment systems used to develop and debug software applications thatexecute on these architectures. These systems may include multipleinterconnected processors that share the use of on-chip and off-chipmemory. A processor may include some combination of instruction cache(ICache) and data cache (DCache) to improve processing. Furthermore,multiple processors, with memory being shared among them, may beincorporated in a single embedded system. The processors may physicallyshare the same memory without accessing data or executing code locatedin the same memory locations or they may use some portion of the sharedmemory as common shared memory.

In early microprocessors, instruction execution was “atomic” in thesense that the processor fetched an instruction and completely executedit before fetching another and executing it, etc. Modern microprocessorstypically execute instructions in several steps rather than atomically.This series of steps is called the “instruction execution pipeline”, orjust the “pipeline”. Typically a pipeline will consist of severalphases, consisting of steps to read the instruction from memory, decodethe instruction, read the values to be operated on, perform theoperation, and write the result to some kind of storage. This is calleda “pipeline” because a processor can have several instructions executingat the same time in different phases, i.e. “in the pipeline”. In thismode of operation, the processor can be fetching an instruction while itis decoding the previous instruction, while it is reading input valuesfor an earlier instruction, etc. By overlapping the execution ofinstructions, we increase the rate at which the processor can executeinstructions.

An implication of pipelining is that an instruction which is in the“read inputs” phase may need a value produced by an earlier instruction,but the “write” of that value has not happened yet. There are generallytwo ways to deal with this situation: either the processor looks forthese situations and insert the appropriate stalls in the pipeline, orthe programmer arranges the instructions such that this never happens byscheduling the dependent instructions far enough apart so that thesituation does not arise. The former solution is generally called a“protected” pipeline, and the latter solution is called an “unprotected”pipeline. Almost all modern general-purpose architectures implement“protected” pipelines.

Protected pipelines have the advantage that they allow the CPU designersto deepen the pipeline in subsequent generations of the processor whilestill properly executing legacy code. However, protected pipelinesgenerally require a great deal of logic to detect situations wheredelays should be inserted in the pipeline.

Unprotected pipelines have the advantage that they require little/nohardware control mechanisms to produce correct program results whenexecuting instructions that require more than one CPU cycle to executein a pipeline. The programmer or compiler is responsible for schedulinginstructions such that instructions complete before their results areneeded by subsequent instructions. Unprotected pipelines allow the useof “multiple-assignment” code, in which multiple writes to a particularregister can be in the pipeline simultaneously. This is a very low-cost,low-complexity alternative to register renaming, or in a processorwithout register re-naming, having enough registers in the architectureto hold all in-flight computations, and is useful for high performancelow power digital signal processing (DSP) applications.

Existing processors are generally designed to have either protected orunprotected behavior.

SUMMARY

This disclosure relates generally to the field of DSPs. Moreparticularly, but not by way of limitation, aspects of the presentdisclosure relate to methods for executing a plurality of instructionsby a processor. One such method includes executing a plurality ofinstructions by a processor by receiving a first instruction forexecution on an instruction execution pipeline. The method also includesbeginning execution of the first instruction. The method furtherincludes receiving one or more second instructions for execution on theinstruction execution pipeline, the one or more second instructionsassociated with a higher priority task than the first instruction. Themethod also includes storing a register state associated with theexecution of the first instruction in one or more registers of a capturequeue associated with the instruction execution pipeline. The methodfurther includes copying the register state from the capture queue to amemory. The method also includes determining that the one or more secondinstructions have been executed. The method further includes copying theregister state from the memory to the one or more registers of thecapture queue. The method also includes restoring the register state tothe instruction execution pipeline from the capture queue.

Another aspect of the present disclosure relates to a processorincluding an instruction execution pipeline having a plurality ofpipeline stages. The processor also includes pipeline circuitryconfigured to receive a first instruction for execution on aninstruction execution pipeline. The pipeline circuitry is furtherconfigured to begin execution of the first instruction. The pipelinecircuitry is also configured to receive one or more second instructionsfor execution on the instruction execution pipeline, the one or moresecond instructions associated with a higher priority task than thefirst instruction. The pipeline circuitry is further configured to storea register state associated with the execution of the first instructionin one or more registers of a capture queue associated with theinstruction execution pipeline. The pipeline circuitry is alsoconfigured to copy the register state from the capture queue to amemory. The pipeline circuitry is further configured to determine thatthe one or more second instructions have been executed. The pipelinecircuitry is also configured to copy the register state from the memoryto the one or more registers of the capture queue. The pipelinecircuitry is further configured to restore the register state to theinstruction execution pipeline from the capture queue.

Another aspect of the present disclosure relates to a processing systemcomprising a memory and a processor. The processor also comprises aninstruction execution pipeline having a plurality of pipeline stages.The processor further comprises pipeline circuitry configured to receivea first instruction for execution on an instruction execution pipeline.The pipeline circuitry is further configured to begin execution of thefirst instruction in an unprotected mode. The pipeline circuitry is alsoconfigured to receive one or more second instructions, after executionof the first instruction has begun, for execution on the instructionexecution pipeline, the one or more second instructions associated witha higher priority task than the first instruction. The pipelinecircuitry is further configured to continue execution of the firstinstruction to obtain a result. The pipeline circuitry is alsoconfigured to store the result of the first instruction in a memory. Thepipeline circuitry further configured to determine that the one or moresecond instructions have been executed. The pipeline circuitry alsoconfigured to copy the result from the memory to an output register ofthe instruction execution pipeline. The pipeline circuitry furtherconfigured to output the result of the first instruction.

BRIEF DESCRIPTION OF THE DRAWINGS

For a detailed description of various examples, reference will now bemade to the accompanying drawings in which:

FIG. 1 illustrates an example processor having multiple data paths.

FIG. 2 illustrates details of functional units and register files of theexample processor.

FIG. 3 illustrates global scalar register file of the example processor.

FIGS. 4-6 illustrate local register files of the example processor.

FIG. 7 illustrates pipeline phases of the example processor.

FIG. 8 is a circuit diagram illustrating example functional units andcapture queues within the data path, in accordance with aspects of thecurrent disclosure.

FIG. 9 illustrates an example functional unit, capture queue, andscoreboard complex, in accordance with aspects of the currentdisclosure.

FIG. 10 illustrates example capture queue register bit fields, inaccordance with aspects of the present disclosure.

FIG. 11 is a timing diagram of an example fast mode switching, inaccordance with aspects of the present disclosure.

FIG. 12 is a flow diagram illustrating a technique for automaticallyloading and unloading capture queue contents by a processor, inaccordance with aspects of the present disclosure.

DETAILED DESCRIPTION

Digital signal processors (DSP) are optimized for processing streams ofdata that may be derived from various input signals, such as sensordata, a video stream, a voice channel, radar signals, biomedicalsignals, etc. Memory bandwidth and scheduling are concerns for digitalsignal processors operating on real-time data. An example DSP processingcore will be described hereinbelow that includes a streaming engine toimprove processing efficiency and data scheduling.

One or more DSP processing cores may be combined with various peripheralcircuits, blocks of memory, etc. on a single integrated circuit (IC) dieto form a system on chip (SoC). See, for example, “66AK2Hx MulticoreKeystone™ DSP+ARM® System-on-Chip,” 2013, which is incorporated byreference herein.

Various embodiments of a processing core within a given family may havea different number of instruction pipeline stages, depending on aparticular technology and cost/performance tradeoffs. The embodimentdescribed here is representative and includes multiple pipelines stages.

FIG. 1 illustrates an example processor 100 that includes dualscalar/vector data paths 115, 116. Processor 100 includes separate levelone instruction cache (L1I) 121 and level one data cache (L1D) 123.Processor 100 includes a L2 combined instruction/data cache (L2) 130that holds both instructions and data. FIG. 1 illustrates a connectionbetween L1I cache and L2 combined instruction/data cache 130 by way of512-bit bus 142. FIG. 1 illustrates a connection between L1D cache 123and L2 combined instruction/data cache 130 by way of 512-bit bus 145. Inthis example of processor 100, L2 combined instruction/data cache 130stores both instructions to back up L1I cache 121 and data to back upL1D cache 123. In this example L2 combined instruction/data cache 130 isfurther connected to higher level cache and/or main memory using knownor later developed memory system techniques but not illustrated inFIG. 1. The size of L1I cache 121, L1D cache 123, and L2 cache 130 maybe implemented in different sizes in various examples; in this example,L1I cache 121 and L1D cache 123 are each 32 kilobytes, and L2 cache 130is 1024 kilobytes. In this example, central processing unit core 110,L1I cache 121, L1D cache 123 and L2 combined instruction/data cache 130are formed on a single integrated circuit. This single integratedcircuit optionally includes other circuits.

Central processing unit core 110 fetches instructions from L1I cache 121as controlled by instruction fetch unit 111. Instruction fetch unit 111determines the next instructions to be executed and recalls a fetchpacket sized set of such instructions. The nature and size of fetchpackets are further detailed below. Instructions are directly fetchedfrom L1I cache 121 upon a cache hit (if these instructions are stored inL1I cache 121). Upon a cache miss (the specified instruction fetchpacket is not stored in L1I cache 121), these instructions are sought inL2 combined cache 130. In this example, the size of a cache line in L1Icache 121 equals the size of a fetch packet, which is 512 bits. Thememory locations of these instructions are either a hit in L2 combinedcache 130 or a miss. A hit is serviced from L2 combined cache 130. Amiss is serviced from a higher level of cache (not illustrated) or frommain memory (not illustrated). In this example, the requestedinstruction is simultaneously supplied to both L1I cache 121 and centralprocessing unit core 110 to speed use.

In this example, central processing unit core 110 includes pluralfunctional units to perform instruction specified data processing tasks.Instruction dispatch unit 112 determines the target functional unit ofeach fetched instruction. In this example central processing unit 110operates as a very long instruction word (VLIW) processor capable ofoperating on plural instructions in corresponding functional unitssimultaneously. Preferably a complier organizes instructions in executepackets that are executed together. Instruction dispatch unit 112directs each instruction to its target functional unit. The functionalunit assigned to an instruction is completely specified by theinstruction produced by a compiler. The hardware of central processingunit core 110 has no part in this functional unit assignment. In thisexample instruction dispatch unit 112 may operate on severalinstructions in parallel. The number of such parallel instructions isset by the size of the execute packet. This will be further detailedhereinbelow.

Instruction decode unit 113 decodes each instruction in a currentexecute packet. Decoding includes identification of the functional unitperforming the instruction, identification of registers used to supplydata for the corresponding data processing operation from among possibleregister files and identification of the register destination of theresults of the corresponding data processing operation. As furtherexplained below, instructions may include a constant field in place ofone register number operand field. The result(s) of this decoding aresignals for control of the target functional unit to perform the dataprocessing operation specified by the corresponding instruction on thespecified data.

Central processing unit core 110 includes control registers 114. Controlregisters 114 store information for control of the functional units inscalar data path side A 115 and vector data path side B 116. Thisinformation may include mode information or the like.

The decoded instructions from instruction decode 113 and informationstored in control registers 114 are supplied to scalar data path side A115 and vector data path side B 116. As a result, functional unitswithin scalar data path side A 115 and vector data path side B 116perform instruction specified data processing operations uponinstruction specified data and store the results in an instructionspecified data register or registers. Each of scalar data path side A115 and vector data path side B 116 include plural functional units thatoperate in parallel. These will be further detailed below in conjunctionwith FIG. 2. There is a data path 117 between scalar data path side A115 and vector data path side B 116 permitting data exchange.

Central processing unit core 110 includes further non-instruction-basedmodules. Emulation unit 118 permits determination of the machine stateof central processing unit core 110 in response to instructions. Thiscapability will typically be employed for algorithmic development.Interrupts/exceptions unit 119 enables central processing unit core 110to be responsive to external, asynchronous events (interrupts) and torespond to attempts to perform improper operations (exceptions).

Processor 100 includes streaming engine 125. Streaming engine 125supplies two data streams from predetermined addresses typically cachedin L2 combined cache 130 to register files of vector data path side B ofcentral processing unit core 110. This provides controlled data movementfrom memory (as cached in L2 combined cache 130) directly to functionalunit operand inputs.

FIG. 1 illustrates example data widths of busses between various parts.L1I cache 121 supplies instructions to instruction fetch unit 111 viabus 141. Bus 141 is a 512-bit bus in this example. Bus 141 isunidirectional from L1I cache 121 to central processing unit 110. L2combined cache 130 supplies instructions to L1I cache 121 via bus 142.Bus 142 is a 512-bit bus in this example. Bus 142 is unidirectional fromL2 combined cache 130 to L1I cache 121.

L1D cache 123 exchanges data with register files in scalar data pathside A 115 via bus 143. Bus 143 is a 64-bit bus in this example. L1Dcache 123 exchanges data with register files in vector data path side B116 via bus 144. Bus 144 is a 512-bit bus in this example. Busses 143and 144 are illustrated as bidirectional supporting both centralprocessing unit 110 data reads and data writes. L1D cache 123 exchangesdata with L2 combined cache 130 via bus 145. Bus 145 is a 512-bit bus inthis example. Bus 145 is illustrated as bidirectional supporting cacheservice for both central processing unit 110 data reads and data writes.

Processor data requests are directly fetched from L1D cache 123 upon acache hit (if the requested data is stored in L1D cache 123). Upon acache miss (the specified data is not stored in L1D cache 123), thisdata is sought in L2 combined cache 130. The memory locations of thisrequested data are either a hit in L2 combined cache 130 or a miss. Ahit is serviced from L2 combined cache 130. A miss is serviced fromanother level of cache (not illustrated) or from main memory (notillustrated). The requested data may be simultaneously supplied to bothL1D cache 123 and central processing unit core 110 to speed use.

L2 combined cache 130 supplies data of a first data stream to streamingengine 125 via bus 146. Bus 146 is a 512-bit bus in this example.Streaming engine 125 supplies data of this first data stream tofunctional units of vector data path side B 116 via bus 147. Bus 147 isa 512-bit bus in this example. L2 combined cache 130 supplies data of asecond data stream to streaming engine 125 via bus 148. Bus 148 is a512-bit bus in this example. Streaming engine 125 supplies data of thissecond data stream to functional units of vector data path side B 116via bus 149, which is a 512-bit bus in this example. Busses 146, 147,148 and 149 are illustrated as unidirectional from L2 combined cache 130to streaming engine 125 and to vector data path side B 116 in accordancewith this example.

FIG. 2 illustrates further details of functional units and registerfiles within scalar data path side A 115 and vector data path side B116. Scalar data path side A 115 includes L1 unit 221, S1 unit 222, M1unit 223, N1 unit 224, D1 unit 225 and D2 unit 226. Scalar data pathside A 115 includes global scalar register file 211, L1/S1 localregister file 212, M1/N1 local register file 213 and D1/D2 localregister file 214. Vector data path side B 116 includes L2 unit 241, S2unit 242, M2 unit 243, N2 unit 244, C unit 245 and P unit 246. Vectordata path side B 116 includes global vector register file 231, L2/S2local register file 232, M2/N2/C local register file 233 and predicateregister file 234. There are limitations upon which functional units mayread from or write to which register files. These will be described inmore detail hereinbelow.

Scalar data path side A 115 includes L1 unit 221. L1 unit 221 generallyaccepts two 64-bit operands and produces one 64-bit result. The twooperands are each recalled from an instruction specified register ineither global scalar register file 211 or L1/S1 local register file 212.L1 unit 221 may perform the following instruction selected operations:64-bit add/subtract operations; 32-bit min/max operations; 8-bit SingleInstruction Multiple Data (SIMD) instructions such as sum of absolutevalue, minimum and maximum determinations, circular min/max operations,and various move operations between register files. The result may bewritten into an instruction specified register of global scalar registerfile 211, L1/S1 local register file 212, M1/N1 local register file 213or D1/D2 local register file 214.

Scalar data path side A 115 includes S1 unit 222. S1 unit 222 generallyaccepts two 64-bit operands and produces one 64-bit result. The twooperands are each recalled from an instruction specified register ineither global scalar register file 211 or L1/S1 local register file 212.In this example, S1 unit 222 performs the same type operations as L1unit 221. In another example, there may be slight variations between thedata processing operations supported by L1 unit 221 and S1 unit 222. Theresult may be written into an instruction specified register of globalscalar register file 211, L1/S1 local register file 212, M1/N1 localregister file 213 or D1/D2 local register file 214.

Scalar data path side A 115 includes M1 unit 223. M1 unit 223 generallyaccepts two 64-bit operands and produces one 64-bit result. The twooperands are each recalled from an instruction specified register ineither global scalar register file 211 or M1/N1 local register file 213.In this example, M1 unit 223 performs the following instruction selectedoperations: 8-bit multiply operations; complex dot product operations;32-bit bit count operations; complex conjugate multiply operations; andbit wise logical operations, moves, adds and subtracts. The result maybe written into an instruction specified register of global scalarregister file 211, L1/S1 local register file 212, M1/N1 local registerfile 213 or D1/D2 local register file 214.

Scalar data path side A 115 includes N1 unit 224. N1 unit 224 generallyaccepts two 64-bit operands and produces one 64-bit result. The twooperands are each recalled from an instruction specified register ineither global scalar register file 211 or M1/N1 local register file 213.In this example, N1 unit 224 performs the same type operations as M1unit 223. There may be certain double operations (called dual issuedinstructions) that employ both the M1 unit 223 and the N1 unit 224together. The result may be written into an instruction specifiedregister of global scalar register file 211, L1/S1 local register file212, M1/N1 local register file 213 or D1/D2 local register file 214.

Scalar data path side A 115 includes D1 unit 225 and D2 unit 226. D1unit 225 and D2 unit 226 generally each accept two 64-bit operands andeach produce one 64-bit result. D1 unit 225 and D2 unit 226 generallyperform address calculations and corresponding load and storeoperations. D1 unit 225 is used for scalar loads and stores of 64 bits.D2 unit 226 is used for vector loads and stores of 512 bits. In thisexample, D1 unit 225 and D2 unit 226 also perform: swapping, pack andunpack on the load and store data; 64-bit SIMD arithmetic operations;and 64-bit bit wise logical operations. D1/D2 local register file 214will generally store base and offset addresses used in addresscalculations for the corresponding loads and stores. The two operandsare each recalled from an instruction specified register in eitherglobal scalar register file 211 or D1/D2 local register file 214. Thecalculated result may be written into an instruction specified registerof global scalar register file 211, L1/S1 local register file 212, M1/N1local register file 213 or D1/D2 local register file 214.

Vector data path side B 116 includes L2 unit 241. L2 unit 241 generallyaccepts two 512-bit operands and produces one 512-bit result. The twooperands are each recalled from an instruction specified register ineither global vector register file 231, L2/S2 local register file 232 orpredicate register file 234. In this example, L2 unit 241 performsinstruction similar to L1 unit 221 except on wider 512-bit data. Theresult may be written into an instruction specified register of globalvector register file 231, L2/S2 local register file 232, M2/N2/C localregister file 233 or predicate register file 234.

Vector data path side B 116 includes S2 unit 242. S2 unit 242 generallyaccepts two 512-bit operands and produces one 512-bit result. The twooperands are each recalled from an instruction specified register ineither global vector register file 231, L2/S2 local register file 232 orpredicate register file 234. In this example, S2 unit 242 performsinstructions similar to S1 unit 222. The result may be written into aninstruction specified register of global vector register file 231, L2/S2local register file 232, M2/N2/C local register file 233 or predicateregister file 234.

Vector data path side B 116 includes M2 unit 243. M2 unit 243 generallyaccepts two 512-bit operands and produces one 512-bit result. The twooperands are each recalled from an instruction specified register ineither global vector register file 231 or M2/N2/C local register file233. In this example, M2 unit 243 performs instructions similar to M1unit 223 except on wider 512-bit data. The result may be written into aninstruction specified register of global vector register file 231, L2/S2local register file 232 or M2/N2/C local register file 233.

Vector data path side B 116 includes N2 unit 244. N2 unit 244 generallyaccepts two 512-bit operands and produces one 512-bit result. The twooperands are each recalled from an instruction specified register ineither global vector register file 231 or M2/N2/C local register file233. In this example, N2 unit 244 performs the same type of operationsas M2 unit 243. There may be certain double operations (called dualissued instructions) that employ both M2 unit 243 and the N2 unit 244together. The result may be written into an instruction specifiedregister of global vector register file 231, L2/S2 local register file232 or M2/N2/C local register file 233.

Vector data path side B 116 includes correlation (C) unit 245. C unit245 generally accepts two 512-bit operands and produces one 512-bitresult. The two operands are each recalled from an instruction specifiedregister in either global vector register file 231 or M2/N2/C localregister file 233.

Vector data path side B 116 includes P unit 246. Vector predicate (P)unit 246 performs basic logic operations on registers of local predicateregister file 234. P unit 246 has direct access to read from and writeto predication register file 234.

FIG. 3 illustrates global scalar register file 211. There are 16independent 64-bit wide scalar registers designated A0 to A15. Eachregister of global scalar register file 211 can be read from or writtento as 64-bits of scalar data. All scalar data path side A 115 functionalunits (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit 224, D1 unit 225and D2 unit 226) can read from or write to global scalar register file211. Global scalar register file 211 may be read from as 32-bits or as64-bits and may only be written to as 64-bits. The instruction executingdetermines the read data size. Vector data path side B 116 functionalunits (L2 unit 241, S2 unit 242, M2 unit 243, N2 unit 244, C unit 245and P unit 246) can read from global scalar register file 211 via crosspath 117 under restrictions that will be detailed below.

FIG. 4 illustrates D1/D2 local register file 214. There are sixteenindependent 64-bit wide scalar registers designated D0 to D15. Eachregister of D1/D2 local register file 214 can be read from or written toas 64-bits of scalar data. All scalar data path side A 115 functionalunits (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit 224, D1 unit 225and D2 unit 226) can write to global scalar register file 211. Only D1unit 225 and D2 unit 226 can read from D1/D2 local scalar register file214. It is expected that data stored in D1/D2 local scalar register file214 will include base addresses and offset addresses used in addresscalculation.

FIG. 5 illustrates L1/S1 local register file 212. In this example, L1/S1local register file 212 includes eight independent 64-bit wide scalarregisters designated AL0 to AL7. In this example, the instruction codingpermits L1/S1 local register file 212 to include up to 16 registers. Inthis example, only eight registers are implemented to reduce circuitsize and complexity. Each register of L1/S1 local register file 212 canbe read from or written to as 64-bits of scalar data. All scalar datapath side A 115 functional units (L1 unit 221, S1 unit 222, M1 unit 223,N1 unit 224, D1 unit 225 and D2 unit 226) can write to L1/S1 localscalar register file 212. Only L1 unit 221 and S1 unit 222 can read fromL1/S1 local scalar register file 212.

FIG. 6 illustrates M1/N1 local register file 213. In this example, eightindependent 64-bit wide scalar registers designated AM0 to AM7 areimplemented. In this example, the instruction coding permits M1/N1 localregister file 213 to include up to 16 registers. In this example, onlyeight registers are implemented to reduce circuit size and complexity.Each register of M1/N1 local register file 213 can be read from orwritten to as 64-bits of scalar data. All scalar data path side A 115functional units (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit 224, D1unit 225 and D2 unit 226) can write to M1/N1 local scalar register file213. Only M1 unit 223 and N1 unit 224 can read from M1/N1 local scalarregister file 213.

FIG. 7 illustrates the following pipeline phases: program fetch phase710, dispatch and decode phases 720 and execution phases 730. Programfetch phase 710 includes three stages for all instructions. Dispatch anddecode phases 720 include three stages for all instructions. Executionphase 730 includes one to four stages dependent on the instruction.

Fetch phase 710 includes program address generation (PG) stage 711,program access (PA) stage 712 and program receive (PR) stage 713. Duringprogram address generation stage 711, the program address is generatedin the processor and the read request is sent to the memory controllerfor the L1I cache. During the program access stage 712 the L1I cacheprocesses the request, accesses the data in its memory and sends a fetchpacket to the processor boundary. During the program receive stage 713the processor registers the fetch packet.

Processor core 110 (FIG. 1) and L1I cache 121 pipelines (FIG. 1) arede-coupled from each other. Fetch packet returns from L1I cache can takea different number of clock cycles, depending on external circumstancessuch as whether there is a hit in L1I cache 121 or a hit in L2 combinedcache 130. Therefore, program access stage 712 can take several clockcycles instead of one clock cycle as in the other stages.

The instructions executing in parallel constitute an execute packet. Inthis example, an execute packet can contain up to sixteen 32-bit wideslots for sixteen instructions. No two instructions in an execute packetmay use the same functional unit. A slot is one of five types: 1) aself-contained instruction executed on one of the functional units ofprocessor core 110 (L1 unit 221, S1 unit 222, M1 unit 223, N1 unit 224,D1 unit 225, D2 unit 226, L2 unit 241, S2 unit 242, M2 unit 243, N2 unit244, C unit 245 and P unit 246); 2) a unitless instruction such as a NOP(no operation) instruction or multiple NOP instructions; 3) a branchinstruction; 4) a constant field extension; and 5) a conditional codeextension. Some of these slot types will be further explainedhereinbelow.

Dispatch and decode phases 720 (FIG. 7) include instruction dispatch toappropriate execution unit (DS) stage 721, instruction pre-decode (DC1)stage 722; and instruction decode, operand read (DC2) stage 723. Duringinstruction dispatch to appropriate execution unit stage 721, the fetchpackets are split into execute packets and assigned to the appropriatefunctional units. During the instruction pre-decode stage 722, thesource registers, destination registers and associated paths are decodedfor the execution of the instructions in the functional units. Duringthe instruction decode, operand read stage 723, more detailed unitdecodes are done, as well as reading operands from the register files.

Execution phase 730 includes execution (E1 to E5) stages 731 to 735.Different types of instructions require different numbers of thesestages to complete their execution. These stages of the pipeline play animportant role in understanding the device state at processor cycleboundaries.

During E1 stage 731 the conditions for the instructions are evaluatedand operands are operated on. As illustrated in FIG. 7, E1 stage 731 mayreceive operands from a stream buffer 741 and one of the register filesshown schematically as 742. For load and store instructions, addressgeneration is performed, and address modifications are written to aregister file. For branch instructions, branch fetch packet in PG phase711 is affected. As illustrated in FIG. 7, load and store instructionsaccess memory here shown schematically as memory 751. For single-cycleinstructions, results are written to a destination register file. Thisassumes that any conditions for the instructions are evaluated as true.If a condition is evaluated as false, the instruction does not write anyresults or have any pipeline operation after E1 stage 731.

During E2 stage 732 load instructions send the address to memory. Storeinstructions send the address and data to memory. Single-cycleinstructions that saturate results set the saturation (SAT) bit in thecontrol status register (CSR) if saturation occurs. For 2-cycleinstructions, results are written to a destination register file.

During E3 stage 733 data memory accesses are performed. Any multiplyinstructions that saturate results set the SAT bit in the control statusregister (CSR) if saturation occurs. For 3-cycle instructions, resultsare written to a destination register file.

During E4 stage 734 load instructions bring data to the processorboundary. For 4-cycle instructions, results are written to a destinationregister file.

During E5 stage 735 load instructions write data into a register. Thisis illustrated schematically in FIG. 7 with input from memory 751 to E5stage 1135.

As discussed above, processor 100 can be operated both in a protectedmode and in an unprotected mode. In certain cases, pipeline protectionmay be enabled or disabled by setting a processor bit. For example,protection may be controlled by setting a bit in a control register,such as a task state register. In certain cases, instructions may beused to set the protection modes, such as PROT or UNPROT.

Unprotected mode, or exposed pipeline mode, is the traditional VLIWoperational mode. Unprotected mode requires the programmer or compilerto understand the latencies of the instructions and to insert NOPs orother instructions between dependent instructions to guaranteecorrectness. For example, a first instruction MPY32 A0, A1, A2; Multiplymay be received by the processor. This instruction takes four processorcycles to execute and outputs to the A2 register. If the programmer orcompiler wants to use the output of the MPY32 instruction for a secondinstruction, such as ADD A2, A8, A8; Accumulate, it is up to theprogrammer or compiler to insert three NOP instructions to obtaincorrect behavior. However, unexpected events, such as handling aninterrupt or a cache miss, may cause the programmer or compiler insertedNOP instructions to be inaccurate.

In protected, or unexposed pipeline mode, the pipeline conforms tosequential operation model where dependent instructions are guaranteedto be correct, regardless of how many cycles it takes to complete theinstructions. For an instruction which takes multiple cycles tocomplete, if a subsequent instruction attempts to read the destinationof the first instruction within the delay slots of that firstinstruction, the CPU pipeline will automatically insert NOP cycles untilthe instruction which will write that register has completed. In theabove example, if the processor 100 receives, in protected mode, theMPY32 instruction followed by the ADD instruction, the processor 100would automatically insert three NOP cycles between the instructions.

Pipeline hazards may exist in certain processors, such as a multi-stagepipelined processor capable of processing multiple instructions in apipeline. Unresolved pipeline hazards generally are conditions where aprocessor may produce undesired or unexpected results. Different typesof pipeline hazards may exist. Two such types include data hazards andstructural hazards. Data hazards generally are scenarios where aninstruction executing in a pipeline refers to data from a precedinginstruction. Data hazards can result in race conditions if not handled.Generally, data hazards include a read after write and a write afterwrite. Examples of data hazards include, but are not limited to, when alater in time instruction attempts to access a result of a previousinstruction that is still being processed.

Structural hazards generally occur due to the structure of the datapathfor a processor. Certain processors may be limited in the way writes areperformed. In one such example, a single functional unit may be able toperform a single write to an output register file per clock cycle, and asituation may arise where two instructions attempt to output theirresults to the same register in a single cycle. Thus, when a firstinstruction which takes two clock cycles to complete is executed on afunctional unit, followed by a second instruction which takes one clockcycle to complete on the same functional unit, both instructions wouldcomplete and attempt to write to the output register file in the samecycle.

In certain processors, when executing in protected mode, when a pipelinedependency is found, all of the functional units and entire executionpipeline from instruction fetch through the E1 stage may be stalled. Asall functional units are stalled, no units are allowed to advance untilthe pipeline conflict has been resolved. To help address data hazardconditions, enable fast processor mode switching, and address load/storelatency in both protected and unprotected modes, as well as enablerecoverable interrupts in unprotected mode, capture queues may be used.The capture queue structures help save a state of a pipeline registerand later write back the saved state, for example to continue executionor output to the general register file. Capture queues may be used todetect hazard conditions, generate appropriate stalls, and load andunload capture queue registers to help address pipeline hazards inprotected mode. As discussed herein, while interrupts and exceptions aredistinct concepts, they can be handled by a processor in a similarmanner and the terms may be used interchangeably in this disclosure.

In certain cases, capture queues may also be used in conjunction withprocessors executing in an unprotected mode, or processors withunprotected pipelines. For example, capture queues may be used to helpenable recoverable interrupts. As an example, a processor may receive afour cycle MPY32 instruction that outputs to the A2 register in fourcycles. As the processor is in unprotected mode, the executing code maythen issue a one cycle shift (SHR) instruction on the data currently inA2. The SHR instruction is then followed by a one cycle move (MV)instruction which moves the shifted data in A2 to an A3 register. A NOPmay then be inserted and then the results of the MPY instructions areoutput to A2. An ADD instruction may then be performed using data fromA2. If an interrupt is received after the SHR instruction but before theMV, undesired results may occur. For example, the transfer to theinterrupt handler may make sure all pending writes in the pipeline arecompleted before beginning the execution of the interrupt handler toavoid results from the interrupt handler corrupting the program. Theinterrupt handler would thus allow the MPY32 instruction to complete andoutput to A2. After the interrupt handler returns, the results of theMPY32 would be restored to A2 and the next instruction, MV, to execute.However, the MV instruction would now execute on the results of theMPY32, rather than on the results of the SHR instruction.

FIG. 8 is a circuit diagram 800 illustrating example functional unitsand capture queues within the data path, in accordance with aspects ofthe current disclosure. While shown in the context of a scalar datapath, in certain cases, capture queues may be utilized with both scalarand vector data paths. According to certain aspects, capture queues mayinclude a scoreboard 802 including hazard detection logic, local unitcapture queues 804A-804E (collectively 804), and a central capture queue806. The scoreboard 802 includes a writeback queue comprising a set ofregisters and the scoreboard 802 is coupled to an associated set offunctional units 808A-808E (collectively 808) and the central capturequeue 806. The functional units 808 may be each associated with arespective local unit capture queue 804.

In accordance with certain aspects, capture queues help enablerecoverable interrupts in a pipelined processor. As discussed above, aprocessor pipeline may include multiple stages, each stage performing adiscrete step to process the instruction. Multiple instructions may beexecuting at different stages of the pipeline. Stalling and clearing theentire pipeline, for example, to handle an interrupt, is relativelyinefficient. Moreover, interrupt handler instructions are executed viathe processor pipeline stages and clearing the entire pipeline would notchange the number of cycles needed for the interrupt handlerinstructions to clear the processor pipeline. Rather than discardingpartially executed instructions, execution of these instructions maycontinue to completion and the results stored to the capture queuestructure. For example, a four cycle MPY32 instruction may be received,followed by a multi-cycle load (LDD) instruction in the next processorcycle. When the LDD instruction is received, the MPY32 instruction is inthe E2 cycle. During processing in E1, the LDD instruction incurs acache miss resulting in an exception. The LDD instruction is thendiscarded and the exception handler is loaded. However, the MPY32instruction can continue to execute to completion in the E2-E4 stagesand the result of the MPY32 instruction stored in the capture queue. Incertain cases, the result of the MPY32 instruction may be stored in thecentral capture queue 806 as the local capture queue 804 may be neededby instructions of the exception handler. As the MPY32 instructioncontinues, instructions of the exception handler may also be executed inthe pipeline. Once the exception handler finishes, the LDD instructionmay be reissued to E1 for execution and the results of the MPY32instruction restored to the local capture queue 804 for output to theoutput register 810.

Progress of instructions that take more than one execution cycle may betracked to help make sure information is written to the correct locationand at the correct time, in accordance with aspects of the presentdisclosure. For example, the scoreboard 802 may include a writebackqueue. In certain cases, the writeback queue may be a set of registersthat may be used to store information associated with an entry to alocal capture queue 804. The information in the writeback queue mayinclude a lifetime tracking value which local capture queue acorresponding instruction should be written back to.

In unprotected mode and as the instruction enters the E1 stage, thevalue of the lifetime tracking value corresponds to the expected numberof cycles needed for the functional unit 808 to process the instruction.These lifetime tracking values may be adjusted, such as by decrementingthe value, for each clock cycle where the processor is not stalled. Thelifetime tracking value may be stalled anytime the pipeline is stalled.This scoreboarding helps enable interrupt/event recovery by trackingwhere values from the local unit capture queues 804 should be restoredto. When the lifetime tracking value equals 0, the results of theinstruction are ready to be written back to the output register.

If an instruction is interrupted before the lifetime tracking value hasbecome zero, the instruction result and its corresponding lifetimetracking value may be saved to maintain correct execution upon returningfrom the interrupt. For example, upon receiving the interrupt, thescoreboard 802 may stall the pipeline and any portion of the MPY32instruction that had already been performed and the state of thepipeline stages may be saved to the local unit capture queue 804 andthen to the central capture queue 806. The corresponding lifetimetracking value may also be saved, for example, in the writeback queue.The interrupt may then be processed and after the interrupt is handled,any results and state related to the MPY32 instruction saved in thelocal unit capture queue 804, or the central capture queue 806, may berestored. Processing of the MPY32 may then resume based on the restoredlifetime tracking value.

In certain cases, an instruction in the first stage of execution, forexample the E1 stage, will not be restored in the first stage. Rather,the instruction can be reloaded into the first stage and run whenprocessing resumes. For example, in certain cases, a pipeline canreceive two instructions at once as a double. In such cases, the resultsof these two instructions may output in the same cycle. As a morespecific example, SUB and LDD commands may be issued together as adouble instruction. The two commands both enter the E1 stage and areprocessed. The LDD command, while attempting to access a memory addressto output the contents of the memory address, may experience a pagefault and throw a page fault exception. As the SUB command is a singlecycle command, a result of the SUB command is ready for output at theend of the E1 stage. This output may be saved to the central capturequeue 806 as the E1 stage, in certain cases, may not have an associatedlocal capture queue. Execution then proceeds to the exception handler.After the exception handler finishes, execution returns to the mainprocess. As the first execution of the LDD command resulted in anexception, the LDD command needs to be re-executed to obtain the desiredresults. The results of the SUB command stored in the central capturequeue 806 may then be discarded as the SUB and LDD double instruction isreloaded into E1 and re-executed. In certain cases, a two-cycle commandmay be issued as a part of a double instruction, for example with theLDD command. The multi-cycle command may then proceed to E2 prior to theexception handler execution and would be allocated a writeback queueentry. Generally, a writeback queue entry is made whenever there is anitem stored in the local capture queue. The multi-cycle command may alsobe rolled back into E1 and re-executed with the LDD instruction.However, rolling back the execution state may require tracking moreinstruction results than the number of pipeline stages. In certaincases, the number of registers in the writeback queue may exceed thenumber of pipeline stages to handle boundary cases around trackinginstructions that are exiting the E1 stage to the E2 stage andgenerating an output, but are going to be rolled back to the E1 stage.

In certain cases, if execution of the MPY32 instruction has alreadybegun when the interrupt is received, for example, the MPY32 instructionis in the E2-E4 stages, then the MPY32 instruction may be executed tocompletion and the results stored in the central capture queue 806 viathe local unit capture queue 804. After the interrupt is handled, thestored results from the MPY32 instruction are restored from the centralcapture queue 806 to the local unit capture queue 804 for output.

In certain cases, the local unit capture queue 804 and central capturequeue 806 may be omitted and instead a save memory or register may beused to enable interrupt handling in unprotected mode. In such cases, ifan interrupt is received after execution of an instruction has started,for example in the E2-E4 stages, the instruction may be executed tocompletion and the results stored in the save memory. After theinterrupt is handled, then the stored result is written to the outputregister. If the interrupt is received before execution of theinstruction has started, for example in the E1 stage, then theinstruction is reloaded after the interrupt is handled. If theinstruction passes the E1 stage and moves to E2, a local unit capturequeue may be allocated for the instruction.

In accordance with certain aspects, information in the writeback queuemay also include a latency value to help track the lifetime of anassociated instruction. The latency value may be adjusted, such as bydecrementing the value, for each clock cycle, regardless whether thepipeline is stalled. If there are no pipeline stalls, then both thelifetime tracking value and the latency value will expire at the sametime and the results of the instruction may be written to the outputregister file. As discussed above, adjusting the lifetime tracking valueassociated with the instruction may be stalled if the pipeline isstalled. However, if the instruction is past the E1 stage, execution ofthe instruction continues until the instruction is completed. In suchcases, the latency counter will reach its expiration value (e.g., zero)before the lifetime tracking value reaches its expiration value (e.g.,zero) and the results of the instruction may be captured in the localunit capture queue. Where an output has been captured by the local unitcapture queue, the writeback queue entry may continue to track theoutput until the lifetime reaches its expiration value. When thelifetime value reaches its expiration value and the pipeline is notstalled, the output may be transferred from the local unit capture queueinto the output register file specified by the instruction.

In accordance with certain aspects, the scoreboard 802 may also trackmemory load operations which have not completed, such as those due tounexpected events in the memory system (for example, a cache miss). Incertain cases, the scoreboard 802 may track up to a fixed number of (forexample, up to eight) outstanding loads which have not completed beforestalling a pipeline due to L1D read data not being returned. There areat least three general conditions that may result in a pipeline stalldue to memory load conditions. First, in protected mode, if adestination of a load instruction is read as an operand to a subsequentinstruction before the L1D data cache can return data, then the pipelineis stalled until the L1D data cache returns data. Second, in eitherprotected mode or unprotected mode, if the destination of a loadinstruction is read as an operand to an instruction, and the L1D datacache indicates that it will not have the data by the 4 cycle L1D cachelatency, then the pipeline will stall. Third, if the processor has senteight load instructions and data has not been returned for any of them,then the pipelines will stall when it encounters the next loadinstruction, provided it has not stalled already due to any of the abovereasons.

Using the scoreboard 802 to track memory load behavior helps allow theprocessor to accept data returns from the memory system in any order. Incertain cases, the processor can be configured to send a transactionidentifier (ID) with each load instruction, and the L1D can return thecorresponding transaction ID with the load data. The scoreboard 802 mayalso allow the compiler to hoist load instructions further up in theschedule and to hide L1D cache miss penalties when the compiler knows ithas enough other work for the processor. In addition, the scoreboard 802allows the L1D data cache to support hit-under-miss behavior, leading topossible performance improvements in code which has a mixture of loadswhich are likely to miss (such as large database item lookups), andloads that are likely to hit (such as stack accesses).

In accordance with certain aspects, the central capture queue 806 may beholding contents of the local unit capture queues 804, for example, whenan interrupt or exception event occurs. The central capture queue 806may include one or more holding registers Q0-Q4 to delay updates to theprocessor register in case a problem is detected with one or moreinstruction writebacks which should occur at the same time as aninstruction leaves the E1 execution phase. For example, during executionof a load or store instruction, a page fault as a part of branching tothe page fault handling service may be detected by the micro translationlookaside buffer (μTLB). Generally, the μTLB translates load/storeinstruction addresses to physical mappings. In the event that thevirtual to physical address mapping cannot be found for a particularmemory access instruction, the μTLB triggers the page fault in the E1execution phase. The load/save instruction is then placed into thecentral capture queue 806. In protected mode, all instructions ahead ofthe load/save instruction which caused the page fault to completenormally. In unprotected mode, if an instruction ahead of the load/saveinstruction which caused the page fault has not reached its normalwriteback cycle prior to the detection of the page fault by the μTLB,the results of such an instruction will be saved in the central capturequeue 806 or local unit capture queue 804 to be output to the registerfile after the page fault is resolved. After the page fault is resolved,such as after the correct page translation entry is located, theload/save instruction is restored and execution with the correct pagetranslation entry resumed. In certain cases, a correctable problem withthe execution of the instruction may be detected when the instruction isin the E2 stage of execution. If the processor determines that aninstruction has a correctable problem in the E2 stage, the register fileupdates that were delayed in the central capture queue 806 will bereturned to the local unit capture queues 804, so they can be saved whenthe processor transfers execution to the exception handler.

According to certain aspects, in protected mode, when an interrupt isreceived, execution of the instructions already in the pipeline beforethe interrupt are executed normally, followed by the interrupt, and thenthe remaining instructions are executed. As the program expects theprocessor to insert delays as needed, interrupt handing isstraightforward. In unprotected mode, as instruction scheduling ishandled by the application program or compiler itself, attempting toexecute an interrupt in the middle of executing application code wouldlikely throw off the instruction scheduling. The local unit capturequeues can be used to help address such a potential scheduling issue.When operating in unprotected mode, when an interrupt is received, thecontents of a pipeline of the functional unit handling the interrupt maybe written to the local unit capture queues. The interrupt is thenprocessed and the pipeline restored after the interrupt is handled.However, the capture queues may be used for data hazard and load/storeout of order completion, as well as handling interrupts. In some cases,the pipeline may be operating in unprotected mode prior to receiving theinterrupt, but is switched, such as by the interrupt handler, toprotected mode after the interrupt is received but before returningcontrol to the application code. As the local unit capture queues may beused when operating in protected mode, the pipeline data in the localunit capture queues may be offloaded, for example, to a memory. Thismemory space may be space within a cache memory, such as in the L1, L2,or L3 cache, or another memory that may be on-die static random-accessmemory (SRAM).

When it is known that the local unit capture queues need to be unloaded,such as when an interrupt is received while operating in unprotectedmode, the processor can help pre-write allocate a block of memory in thememory space for the contents of the local unit capture queues. Eachexecuting task in the processor is associated with an event context savepointer (ECSP) pointing to the memory space. When the original task isinterrupted by the interrupt, or another higher priority task, the stateof the pipeline registers for the functional unit are saved to the localunit capture queues and then copied to the block of memory based on aECSP-A pointing to the block of memory. The functional unit then beginsto execute the interrupt task and rewrites the ECSP to ECSP-B associatedwith the interrupt task. During execution of the interrupt task, thelocal unit capture queues are used to complete the interrupt task. Whenthe interrupt task completes, the original task is reloaded and the ECSPis rewritten based on ECSP-A. Based on ECSP-A, the state of the pipelineregisters is copied to the local unit capture queues and then thepipeline registers. Execution of the original task resumes where theprevious execution was left off.

FIG. 9 illustrates an example functional unit, capture queue andscoreboard complex 900, in accordance with aspects of the currentdisclosure. A functional unit 902 of the complex 900, as shown,corresponds to the .M functional unit 808B from FIG. 8. The functionalunit 902 includes four pipe stages and other functional units mayinclude more or fewer pipe stages. Each pipe stage of functional unit902 takes one clock cycle to complete. Each instruction can take adifferent number of cycles to process. For example, a first instructionmay take two cycles to complete and the output thus comes from the E2pipe stage. Each functional unit can produce a single write to theoutput register file 914 per clock cycle via a results bus 916. A localunit capture queue 904 helps to keep track of the pipeline registercontents in a corresponding functional unit. Generally, there may be onelocal unit capture queue 904 per functional unit. Each pipe stage thatcan produce a result (here E1, E2, and E4) may be coupled to one or moreMUX 906A-906C and capture queue registers 908A-908C of the local unitcapture queue 904. Connecting pipe stages to multiple capture queueregisters helps processing long series of instructions. For example, itis possible to have a series of instructions in a pipeline which wouldall attempt to write to the output register in the same clock cycle,such as a four cycle instruction, followed by a three cycle, then twocycle, and one cycle instructions. In such a case, the four cycleinstruction would be written to the output register and the three cycle,two cycle, and one cycle instructions stored in capture queue registers908A-908C.

The local unit capture queue 904 may operate in conjunction with thescoreboard 910. The scoreboard 910 is coupled, along with the centralcapture queue 918, to MUX 906A-906C and clock gate enables of thecapture queue registers 908A-908C via bus 912. Scoreboard 910 maintainsa set of registers which may help track whether a functional unit isworking on producing a result. A bit corresponding to a register is highif the corresponding register of the functional unit is working onproducing the result as the writeback value of the correspondingregister. All the functional unit scoreboard tracking register writebackresults then get OR'ed together at the top level to consolidate allregisters usage per cycle. The scoreboard 908 then may make a set ofcomparisons. In certain cases, the scoreboard 908 may compare each readoperand of each functional unit to detect potential read-after-writehazards in protected mode. For example, if .N scr1 operand is registerA1, and A1 will be written back by .M unit in two cycles, .N will detectif another instruction operand is attempting to read A1 and stall theinstruction operand which reads A1 at E1 stage until the correspondingbit is set low. The corresponding bit may also be compared against awrite address of every unit to detect Write-After-Write hazarding inprotected mode. For example, if another functional unit, such as .L, iswriting to A1, and A1 will be written back by .M functional unit inthree cycles which is two cycles after the .L functional unit hasfinished working to produce the A1 writeback value, then the hazardinglogic is used to load the .L functional unit's local capture queue until.M is done writing A1 and the corresponding bit is set low. Then, the .Lfunctional unit's local capture queue will unload the A1 value from itsstorage and put it on .L's output.

FIG. 10 illustrates example capture queue register bit fields 1000, inaccordance with aspects of the present disclosure. It can be understoodthat the fields shown, their order, and field sizes may vary and thatthe fields, as illustrated in FIG. 10 illustrate one example of capturequeue register bit fields. Bit fields 1002 and 1004 illustrate twoexample data formats for capture queues and writeback queues. Accordingto certain aspects, information from block 1006 is stored in thewriteback queue and information from block 1008 is stored in the capturequeues. In this example for the writeback queue, V represents whether abit is valid, DV indicates whether a write is updating a main registerfile, PV indicates whether this write is updating the predicate registerfile, RFNUM encodes which register file is being written, RFADDR encodesa register file address, RFPADDR encodes a predicate register fileaddress, and LIFE encodes the lifetime tracking value. For the capturequeues, FP Status represents the predicate file status and DATArepresents the stored data.

As illustrated in FIG. 11, the capture queue structure also helps enablefast mode switching as between protected mode and unprotected mode, andvice versa. Previously certain processors could switch, for examplebetween unprotected and protected modes, but generally, would stall theinstructions after the switch command until all active instructions werefinished. The capture queue helps allow switching from unprotected modeto protected mode, and vice versa, without clearing the pipeline or evenstalling in certain cases. For example, while switching from unprotectedmode to protected mode, the lifetime of any instructions already in thepipeline may be set to less than 0, such as −1, meaning that that thecorresponding instruction should have already been committed to theregister file. Hazarding logic, as described above, associated withprotected mode then becomes active. In cycle 1 of FIG. 11, the processorpipeline executing the instructions illustrated is executing inunprotected mode. At cycle 4, the PROT command is executed in E1 and thepipeline is switched to protected mode. The lifetime tracking value ofMPY is then set to −1. The lifetime tracking value for the ADD commandis then set to the value normally associated with the ADD command asexecution of the command has not yet begun. Execution of the ADD commandthen proceeds as normal as discussed above if the ADD command utilizesthe A0 register that the MPY32 command is outputting to. In the casethat the ADD command does not utilize the same registers as the MPY32command, then the ADD command can be executed immediately after the PROTcommand without stalling the pipeline.

FIG. 12 is a flow diagram 1200 illustrating a technique forautomatically loading and unloading capture queue contents by aprocessor, in accordance with aspects of the present disclosure. Atblock 1202, one or more first instructions for execution on aninstruction execution pipeline are received. At block 1204, theexecution pipeline of a functional unit may begin execution of a firstinstruction, of the one or more first instructions on the instructionexecution pipeline. For example, the execution pipeline may beginexecuting a set of instructions at a first priority level. Thisexecution may proceed in an unprotected mode. The set of instructionsmay be associated with a pointer to a memory space. At block 1206, oneor more second instructions for execution on the instruction executionpipeline may be received. The one or more second instructions may beassociated with a higher priority level than the first one or moreinstructions. For example, the processor may receive an interrupt orexception process with a higher priority level than the earlierexecuting instructions (e.g., from block 1204). At block 1208, theprocessor stores a register state associated with the execution of thefirst instruction in one or more registers of a local unit capture queueassociated with the instruction execution pipeline. For example, thestate of the execution pipeline for the first set of instructions may besaved into the local unit capture queue. At block 1210, the processorcopies the register state from the local unit capture queue to a memoryspace. For example, the information from the local unit capture queuemay be copied to an allocated memory space. This memory space may be oneor more of a L1, L2, L3 cache or other SRAM memory space. At block 1212,the processor determines that the one or more second instructions havebeen executed. For example, the processor may determine that theexecution of the interrupt or exception handler has finished. At block1214, the processor copies the register state from the cache memory tothe one or more registers of the local unit capture queue and restoresthe register state to the instruction execution pipeline from the localunit capture queue. For example, after detecting that the higherpriority instructions have completed, the processor reloads the savedstate information from the memory space to the local unit capture queuesand restores the execution pipeline.

The above discussion is meant to be illustrative of the principles andvarious implementations of the present disclosure. Numerous variationsand modifications will become apparent to those skilled in the art oncethe above disclosure is fully appreciated. It is intended that thefollowing claims be interpreted to embrace all such variations andmodifications.

In the drawings, like elements are denoted by like reference numeralsfor consistency.

In this description, the term “couple” or “couples” means either anindirect or direct wired or wireless connection. Thus, if a first devicecouples to a second device, that connection may be through a directconnection or through an indirect connection via other devices andconnections. The recitation “based on” means “based at least in parton.” Therefore, if X is based on Y, X may be a function of Y and anynumber of other factors.

Modifications are possible in the described embodiments, and otherembodiments are possible, within the scope of the claims.

What is claimed is:
 1. A circuit device comprising: a functional unitthat includes a set of pipeline stages configured to collectivelyexecute an instruction; a local capture queue coupled to the functionalunit that includes a set of registers, wherein each register of the setof registers is coupled to a respective stage of the set of pipelinestages to store a respective intermediate result of the instruction; anda scoreboard coupled to the functional unit and the local capture queueand configured to: based on receiving the instruction, set a lifetimetracking value based on an expected duration of execution of theinstruction; and adjust the lifetime tracking value during the executionof the instruction by the set of pipeline stages.
 2. The circuit deviceof claim 1, wherein: the instruction is a first instruction; and thescoreboard is further configured to: in response to a secondinstruction, preempt the first instruction by: causing a first registerof the local capture queue to store a first intermediate result of thefirst instruction from a first stage of the set of pipeline stages; andbased on the second instruction having completed, using the lifetimetracking value to restore the first intermediate result to the set ofpipeline stages.
 3. The circuit device of claim 2 further comprising: asecond capture queue coupled to the scoreboard, wherein the scoreboardis further configured to, in response to the second instruction, causethe second capture queue to store contents of the local capture queueincluding the first intermediate result such that, during execution ofthe second instruction, each register of the set of registers of thelocal capture queue is configured to store a respective intermediateresult of the second instruction.
 4. The circuit device of claim 3,wherein the scoreboard is further configured to, based on the secondinstruction having completed, transfer the contents including the firstintermediate result from the second capture queue to the local capturequeue.
 5. The circuit device of claim 3 further comprising a cachememory that includes the second capture queue.
 6. The circuit device ofclaim 2, wherein the scoreboard is configured to preempt the firstinstruction based on the second instruction being associated with aninterrupt.
 7. The circuit device of claim 2, wherein the scoreboard isconfigured to preempt the first instruction based on the secondinstruction being associated with an exception event.
 8. The circuitdevice of claim 2, wherein the scoreboard is configured to preempt thefirst instruction based on the second instruction having a higherpriority than the first instruction.
 9. The circuit device of claim 2,wherein the scoreboard is configured to preempt the first instructionbased on the execution of the first instruction being in an unprotectedpipeline mode.
 10. The circuit device of claim 9, wherein the scoreboardis configured to allow a third instruction to execute without preemptionbased on execution of the third instruction being in a protectedpipeline mode.
 11. The circuit device of claim 1, wherein the scoreboardis configured to: set the lifetime tracking value to be an expectednumber of cycles for the execution of the instruction; and adjust thelifetime tracking value by decrementing the lifetime tracking valueduring each clock cycle that the execution of the instruction by the setof pipeline stages proceeds without a stall.
 12. A method comprising:receiving an instruction for execution using a set of pipeline stages;based on the receiving of the instruction, setting a lifetime trackingvalue based on an expected duration of execution of the instruction;executing the instruction using the set of pipeline stages; during theexecuting of the instruction, storing a set of intermediate results ofthe instruction in a local capture queue; and during the executing ofthe instruction, adjusting the lifetime tracking value.
 13. The methodof claim 12, wherein: the instruction is a first instruction; and themethod further comprises: receiving a second instruction; and based onthe receiving of the second instruction, preempting the firstinstruction, wherein the preempting includes: storing a firstintermediate result of the first instruction provided by a first stageof the set of pipeline stages in the local capture queue; and based onthe second instruction having completed, restoring the firstintermediate result to the set of pipeline stages using on the lifetimetracking value.
 14. The method of claim 13, wherein the preemptingincludes transferring contents of the local capture queue including thefirst intermediate result to a second capture queue.
 15. The method ofclaim 14, wherein the preempting includes, based on the secondinstruction having completed, transferring the contents from the secondcapture queue to the local capture queue.
 16. The method of claim 13,wherein the preempting of the first instruction is based on the secondinstruction being associated with an interrupt.
 17. The method of claim13, wherein the preempting of the first instruction is based on thesecond instruction being associated with an exception event.
 18. Themethod of claim 13, wherein the preempting of the first instruction isbased on the second instruction having a higher priority than the firstinstruction.
 19. The method of claim 13, wherein the preempting of thefirst instruction is based on the execution of the first instructionbeing in an unprotected pipeline mode.
 20. The method of claim 19further comprising allowing a third instruction to execute withoutpreemption based on execution of the third instruction being in aprotected pipeline mode.